The Number of Minimum Roman and Minimum Total Dominating Sets for Some Chessboard Graphs
نویسندگان
چکیده
منابع مشابه
On unique minimum dominating sets in some Cartesian product graphs
Unique minimum vertex dominating sets in the Cartesian product of a graph with a complete graph are considered. We first give properties of such sets when they exist. We then show that when the first factor of the product is a tree, consideration of the tree alone is sufficient to determine if the product has a unique minimum dominating set.
متن کاملTwo Minimum Dominating Sets with Minimum Intersection in Chordal Graphs
We prove that the problem of nding two minimum dominating sets (connected dominating sets or vertex clique covers) with minimum intersection is linearly solvable in interval graphs. Furthermore, the problem of deciding whether or not there exist two disjoint minimum dominating sets (connected dominating sets or vertex clique covers) is shown to be NP-hard for chordal graphs.
متن کاملTrees with unique minimum total dominating sets
A set S of vertices of a graph G is a total dominating set if every vertex of V (G) is adjacent to some vertex in S. We provide three equivalent conditions for a tree to have a unique minimum total dominating set and give a constructive characterization of such trees.
متن کاملBlock graphs with unique minimum dominating sets
For any graph G a set D of vertices of G is a dominating set, if every vertex v∈V (G)− D has at least one neighbor in D. The domination number (G) is the smallest number of vertices in any dominating set. In this paper, a characterization is given for block graphs having a unique minimum dominating set. With this result, we generalize a theorem of Gunther, Hartnell, Markus and Rall for trees. c...
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Journal of Discrete Mathematics
سال: 2020
ISSN: 2161-7635,2161-7643
DOI: 10.4236/ojdm.2020.101004